Generational GA Steady - State GAProblem Fitness Evaluations Fitness
نویسنده
چکیده
Traditional genetic algorithms use operator settings such as the crossover rate or number of crossover points that are xed throughout a given run. The choice of settings can have a major eeect on performance, but nding good settings can be hard. One option is to encode the operator settings onto each member of the GA population, and allow them to evolve too. This paper describes an empirical investigation into co-evolving operator settings in genetic algorithms. The results indicate that the problem representation and the choice of operators that are applied to the encoded operator settings is important for useful adaptation to take place.
منابع مشابه
Prescriptive Treatment Optimization Using a Genetic Algorithm: A Tool for Forest Management
This paper describes research on the use of a multiobjective genetic algorithm (GA) to optimize prescriptive treatment plans for forest management. The algorithm is novel, in that (1) the plans generated by the algorithm are highly specific, stating precisely when and where treatments are to be applied; and (2) logical rules and inference engines developed for a decision support system are used...
متن کاملThe Spatially-Dispersed Genetic Algorithm
Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern with these systems is that they need to be carefully configured in order to operate at their optimum. Failure to do so can often result in performance that is significantly under that of an equivalent non-spatial implementation. T...
متن کاملGenetic drift in genetic algorithm selection schemes
A method for calculating genetic drift in terms of changing population fitness variance is presented. The method allows for an easy comparison of different selection schemes and exact analytical results are derived for traditional generational selection, steady-state selection with varying generation gap, a simple model of Eshelman’s CHC algorithm, and (μ + λ) evolution strategies. The effects ...
متن کاملEvolving Indirectly Represented Melodies with Corpus-Based Fitness Evaluation
The paper addresses the issue of automatic generation of music excerpts. The character of the problem makes it suitable for various kinds of evolutionary computation algorithms. We introduce a special method of indirect melodic representation that allows simple application of standard search operators like crossover and mutation with no repair mechanisms necessary. A method is proposed for auto...
متن کاملMore on Computational Effort Statistics for Genetic Programming
In this contribution we take a look at the computational effort statistics as described by Koza. We transfer the notion from generational genetic programming to tournament-selection (steady-state) GP and show why, in both cases, the measured value of the effort often differs from its theoretical counterpart. It is discussed how systematic estimation errors are introduced by a low number of expe...
متن کامل